Wee LCP

نویسنده

  • Johannes Fischer
چکیده

We prove that longest common prefix (LCP) information can be stored in much less space than previously known. More precisely, we show that in the presence of the text and the suffix array, o(n) additional bits are sufficient to answer LCP-queries asymptotically in the same time that is needed to retrieve an entry from the suffix array. This yields the smallest compressed suffix tree with sublogarithmic navigation time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Importance of the latex-clearing protein (Lcp) for poly(cis-1,4-isoprene) rubber cleavage in Streptomyces sp. K30

Streptomyces sp. strain K30 induces the formation of an extracellular Lcp (latex-clearing protein) during poly(cis-1,4-isoprene) degradation. To investigate the function of this enzyme in Streptomyces sp. strain K30, the lcp gene was disrupted. This was the first time that the screening for a knock out lcp mutant of Streptomyces sp. strain K30 was successful. The resulting mutant Streptomyces s...

متن کامل

A Plug-Based Microfluidic System for Dispensing Lipidic Cubic Phase (LCP) Material Validated by Crystallizing Membrane Proteins in Lipidic Mesophases.

This paper presents a plug-based microfluidic system to dispense nanoliter-volume plugs of Lipidic Cubic Phase (LCP) material and subsequently merge the LCP plugs with aqueous plugs. This system was validated by crystallizing membrane proteins in lipidic mesophases, including LCP. This system allows for accurate dispensing of LCP material in nanoliter volumes, prevents inadvertent phase transit...

متن کامل

String Inference from the LCP Array

The suffix array, perhaps the most important data structure in modern string processing, is often augmented with the longest common prefix (LCP) array which stores the lengths of the LCPs for lexicographically adjacent suffixes of a string. Together the two arrays are roughly equivalent to the suffix tree with the LCP array representing the tree shape. In order to better understand the combinat...

متن کامل

The characteristics of patients who discontinue their dying process – an observational study at a single university hospital centre

BACKGROUND End-of-life integrated care plans are used as structuring tools for the care of the dying. A widely adopted example is the Liverpool Care Pathway for the Dying Patient (LCP). Recently, several concerns were raised about LCP care, such as a worry that diagnosis of dying might be leading to a self-fulfilling trajectory, including hastening of death. However, data on rates of discontinu...

متن کامل

Sampled Longest Common Prefix Array

When augmented with the longest common prefix (LCP) array and some other structures, the suffix array can solve many string processing problems in optimal time and space. A compressed representation of the LCP array is also one of the main building blocks in many compressed suffix tree proposals. In this paper, we describe a new compressed LCP representation: the sampled LCP array. We show that...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 110  شماره 

صفحات  -

تاریخ انتشار 2010